Technical Report Satisfiability of ATEL with Common and Distributed Knowledge is ExpTime-Complete
نویسنده
چکیده
Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is increasingly widely applied in formal system specification and verification of distributed systems and game-like multi-agent systems. The extension Alternating-time Temporal Epistemic Logic (ATEL) of van der Hoek and Wooldridge of ATL with knowledge modalities widens the scope of reasoning over multi-agent systems with epistemic notions. In this paper, the complexity of some variants of satisfiability problems of ATEL with epistemic operators for common and distributed knowledge is investigated and settled at ExpTimecomplete. Thus ATEL has the same complexity as ATL.
منابع مشابه
Model Checking Pushdown Epistemic Game Structures
In this paper, we investigate the problem of verifying pushdown multiagent systems with imperfect information. As the formal model, we introduce pushdown epistemic game structures (PEGSs), an extension of pushdown game structures with epistemic accessibility relations (EARs). For the specification, we consider extensions of alternating-time temporal logics with epistemic modalities: ATEL, ATEL∗...
متن کاملOptimal Regression for Reasoning about Knowledge and Actions (long version)
We show how in the propositional case both Reiter’s and Scherl & Levesque’s solutions to the frame problem can be modelled in dynamic epistemic logic (DEL), and provide an optimal regression algorithm for the latter. Our method is as follows: we extend Reiter’s framework by integrating observation actions and modal operators of knowledge, and encode the resulting formalism in DEL with announcem...
متن کاملSatisfiability of Alternating-Time Temporal Epistemic Logic Through Tableaux
In this paper we present a tableau-based method to decide the satisfiability of formulas in ATEL, an extension of the alternating-time temporal logic ATL including epistemic modalities for individual knowledge. Specifically, we analyse satisfiability of ATEL formulas under a number of conditions. We evaluate the assumptions of synchronicity and of a unique initial state, which have been propose...
متن کاملA Sound and Complete Algorithm for Simple Conceptual Logic Programs
Open Answer Set Programming (OASP) is a knowledge representation paradigm that allows for a tight integration of Logic Programming rules and Description Logic ontologies. Although several decidable fragments of OASP exist, no reasoning procedures for such expressive fragments were identified so far. We provide an algorithm that checks satisfiability in NEXPTIME for the fragment of EXPTIME-compl...
متن کاملATL Satisfiability is Indeed EXPTIME-complete
The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems and game-like multi-agent systems. In this article, we investigate the computational complexity of the satisfiability problem for ATL. For the case where the set of agents is fixed in advance, this problem was settled a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005